Ising model selection using ℓ <sub>1</sub>-regularized linear regression: a statistical mechanics analysis*
نویسندگان
چکیده
Abstract We theoretically analyze the typical learning performance of ℓ 1 -regularized linear regression ( -LinR) for Ising model selection using replica method from statistical mechanics. For random regular graphs in paramagnetic phase, an accurate estimate sample complexity -LinR is obtained. Remarkably, despite misspecification, consistent with same order as logistic -LogR), i.e. M = O log N , where N number variables model. Moreover, we provide efficient to accurately predict non-asymptotic behavior moderate M such precision and recall. Simulations show a fairly good agreement between theoretical predictions experimental results, even many loops, which supports our findings. Although this paper mainly focuses on -LinR, readily applicable precisely characterizing performances wide class -estimators including -LogR interaction screening.
منابع مشابه
High - Dimensional Ising Model Selection Using 1 - Regularized Logistic Regression
We consider the problem of estimating the graph associated with a binary Ising Markov random field. We describe a method based on 1-regularized logistic regression, in which the neighborhood of any given node is estimated by performing logistic regression subject to an 1-constraint. The method is analyzed under high-dimensional scaling in which both the number of nodes p and maximum neighborhoo...
متن کاملHIGH - DIMENSIONAL ISING MODEL SELECTION USING l 1 - REGULARIZED LOGISTIC REGRESSION
We consider the problem of estimating the graph associated with a binary Ising Markov random field. We describe a method based on l1-regularized logistic regression, in which the neighborhood of any given node is estimated by performing logistic regression subject to an l1-constraint. The method is analyzed under high-dimensional scaling, in which both the number of nodes p and maximum neighbor...
متن کاملHigh-Dimensional Graphical Model Selection Using ℓ1-Regularized Logistic Regression
We focus on the problem of estimating the graph structure associated with a discrete Markov random field. We describe a method based on `1regularized logistic regression, in which the neighborhood of any given node is estimated by performing logistic regression subject to an `1-constraint. Our framework applies to the high-dimensional setting, in which both the number of nodes p and maximum nei...
متن کاملHigh-Dimensional Graphical Model Selection Using l1-Regularized Logistic Regression
We consider the problem of estimating the graph structure associated with a discrete Markov random field. We describe a method based on l1-regularized logistic regression, in which the neighborhood of any given node is estimated by performing logistic regression subject to an l1-constraint. Our framework applies to the high-dimensional setting, in which both the number of nodes p and maximum ne...
متن کاملHigh-Dimensional Graphical Model Selection Using $\ell_1$-Regularized Logistic Regression
We focus on the problem of estimating the graph structure associated with a discrete Markov random field. We describe a method based on `1regularized logistic regression, in which the neighborhood of any given node is estimated by performing logistic regression subject to an `1-constraint. Our framework applies to the high-dimensional setting, in which both the number of nodes p and maximum nei...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Statistical Mechanics: Theory and Experiment
سال: 2022
ISSN: ['1742-5468']
DOI: https://doi.org/10.1088/1742-5468/ac9831